কোন্ ধরনের নৃতাত্বিক জনগোষ্ঠীর মধ্যে মাতৃতন্ত্র বিদ্যমান?

Question:

Which of the following data structures operates on a First-In, First-Out (FIFO) principle?

    
• A) Stack
    
• B) Queue
    
• C) Binary Search Tree
    
• D) Priority Queue

Correct Answer: Option B) Queue

Detailed Explanation:

A Queue is a linear data structure that strictly adheres to the FIFO (First-In, First-Out) order of operation. This means that the element inserted first into the collection is always the first one to be removed, identical to a real-world line of people waiting for a service.

Option Breakdown:

    
•         Option A (Stack) — Incorrect: A stack operates on a LIFO (Last-In, First-Out) basis. Elements are pushed and popped from the same end (the top).     
    
•         Option B (Queue) — Correct: Elements are inserted at the back (enqueue) and removed from the front (dequeue), ensuring that elements leave in the exact sequence they entered.     
    
•         Option C (Binary Search Tree) — Incorrect: A binary search tree is a non-linear, hierarchical data structure used for efficient searching, insertion, and deletion, not a sequential FIFO buffer.     
    
•         Option D (Priority Queue) — Incorrect: In a priority queue, elements are dequeued based on their assigned priority rather than their arrival sequence.     

Key Takeaway:

Common real-world applications of FIFO queues include CPU task scheduling, printer spooling buffers, and Breadth-First Search (BFS) graph traversal algorithms.